Contextual Recommendation with Path Constrained Random Walks
نویسندگان
چکیده
Recommendation has become an increasingly important research area because of the abundance of online documents and shopping opportunities. The readily available context information for these tasks posts challenges to recommendation systems to deal with heterogeneous and inter-connected problem spaces. In this study, we use a graph representation for publication databases with rich meta-data. With this representation, a Path Constrained Random Walk (PCRW) model is trained to discover effective recommendation strategies represented as edge paths on the graph. Experiments on both citation-based and history-based reading recommendation tasks show that by leveraging rich context information the PCRW based approach outperforms random walk with restart based approachs as well as traditional content-based and collaborative filtering approaches. An online recommendation system for Saccharomyces Genome Database is available at http://hops.ml.cmu.edu:8080/strutsnies.
منابع مشابه
Movie Recommendation using Random Walks over the Contextual Graph
Recommender systems have become an essential tool in fighting information overload. However, the majority of recommendation algorithms focus only on using ratings information, while disregarding information about the context of the recommendation process. We present ContextWalk, a recommendation algorithm that makes it easy to include different types of contextual information. It models the bro...
متن کاملWord Segmentation in Sanskrit Using Path Constrained Random Walks
In Sanskrit, the phonemes at the word boundaries undergo changes to form new phonemes through a process called as sandhi. A fused sentence can be segmented into multiple possible segmentations. We propose a word segmentation approach that predicts the most semantically valid segmentation for a given sentence. We treat the problem as a query expansion problem and use the path-constrained random ...
متن کاملRouting of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes
We consider a constrained shortest path problem with the possibility to refill the resource at certain nodes. This problem is motivated by routing electric vehicles with a comparatively short cruising range due to the limited battery capacity. Thus, for longer distances the battery has to be recharged on the way. Furthermore, electric vehicles can recuperate energy during downhill drive. We ext...
متن کاملA Path Integral Approach for Disordered Quantum Walks in One Dimension
The present letter gives a rigorous way from quantum to classical random walks by introducing an independent random fluctuation and then taking expectations based on a path integral approach.
متن کاملRandom walks on directed Cayley graphs
Previous authors have shown bounds on mixing time of random walks on finite undirected Cayley graphs, both with and without self-loops. We extend this to the most general case by showing that a similar bound holds for walks on all finite directed Cayley graphs. These are shown by use of two new canonical path theorems for mixing time of non-reversible Markov chains. The first result is related ...
متن کامل